EVALUATING COMPUTATIONAL COSTS WHILE HANDLING DATA AND CONTROL PARALLELISM
نویسندگان
چکیده
منابع مشابه
Evaluating Computational Costs while Handling Data and Control Parallelism
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a parallel application is described by a semantic expression involving in an orthogonal manner both data access and control parallelism abstractions. The evaluation of such an expression is driven by a set of rewriting rul...
متن کاملExploiting Parallelism Between Control and Data Computation
In order to obtain continued performance improvements from microprocessors, ways must be found to increase the degree of parallel execution. However, the parallelism of single-threaded programs is limited by the control flow within the code. This paper proposes a technique to reduce the control flow bottleneck by observing that much of the control flow computation can be performed in parallel w...
متن کاملComputational Costs versus Benefits of Control Reasoning
‘This research was supported by the following grants: NIH Grant RR-00785; NIH Grant RR-00711; Boeing Grant W266875; NASA/Ames Grant NCC 2-274; DARPA Contract N00039-83-C0136; ONR Contract N00014-86-K-0652. We thank Micheal Hewett, M. Vaughan Johnson Jr., Robert Schulman and Jeff Harvey for their work on BBl. We thank Russ Altman, Jim Brinkley, Bruce Duncan, Olivier Lichtarge, John Brugge, and O...
متن کاملParallelism in computational chemistry
An account is given of experience gained in implementing computational chemistry application software, including quantum chemistry and macromolecular refinement codes, on distributed memory parallel processors. In quantum chemistry we consider the coarse-grained implementation of Gaussian integral and derivative integral evaluation, the direct-SCF computation of an uncorrelated wavefunction,~th...
متن کاملHandling Parallelism in a Concurrency Model
Programming models for concurrency are optimized for dealing with nondeterminism, for example to handle asynchronously arriving events. To shield the developer from data race errors effectively, such models may prevent shared access to data altogether. However, this restriction also makes them unsuitable for applications that require data parallelism. We present a library-based approach for per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2008
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626408003296